Towards a Compiler for Reals 1

نویسندگان

  • EVA DARULOVA
  • VIKTOR KUNCAK
چکیده

Numerical software, common in scientific computing or embedded systems, inevitably uses a finiteprecision approximation of the real arithmetic in which most algorithms are designed. In many applications, the roundoff errors introduced by finite-precision arithmetic are not the only source of inaccuracy, and measurement and other input errors further increase the uncertainty of the computed results. Adequate tools are needed to help users select suitable data types and evaluate the provided accuracy, especially for safety-critical applications. We present a source-to-source compiler called Rosa which takes as input a real-valued program with error specifications and synthesizes code over an appropriate floating-point or fixed-point data type. The main challenge of such a compiler is a fully automated, sound and yet accurate enough numerical error estimation. We introduce a unified technique for bounding roundoff errors from floating-point and fixedpoint arithmetic of various precisions. The technique can handle nonlinear arithmetic, determine closed-form symbolic invariants for unbounded loops and quantify the effects of discontinuities on numerical errors. We evaluate Rosa on a number of benchmarks from scientific computing and embedded systems and, comparing it to state-of-the-art in automated error estimation, show that it presents an interesting trade-off between accuracy and performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Constraint Database System for Temporal Knowledge

This paper describes how the technology of deductive constraint database systems and constraint query languages can be used to represent and reason with tem poral knowledge First we summarize our approach to manipulating constraints over reals within deductive database sys tems This approach is based on the compile time rewriting of clauses which are not admissible Then we show how the timestam...

متن کامل

Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1

We …rst prove a theorem about reals (subsets of N) and classes of reals: If a real X is 1 in every member G of a nonempty 1 1 class K of reals then X is itself 1. We also explore the relationship between this theorem, various basis results in hyperarithmetic theory and omitting types theorems in !-logic. We then prove the analog of our …rst theorem for classes of reals: If a class A of reals is...

متن کامل

Towards a formal theory of fuzzy Dedekind reals

In the framework of Henkin style higher-order fuzzy logic à LΠω we construct fuzzy real numbers as fuzzy Dedekind cuts over crisp rationals, and show some of their properties provable in à LΠω. The definitions of algebraic operations and a theory of fuzzy intervals are sketched.

متن کامل

Subclasses of the Weakly Random Reals

The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class of Schnorr random reals does not overlap with any of these classes of generic reals, their degrees may. In this paper, we describe the extent to which this is possible for the Turing, weak truth-table, and truth-table ...

متن کامل

Degrees of Weakly Computable Reals

A real α is left-recursively enumerable (left-r.e. for short) if we can effectively generate α from below. That is, the left Dedkind cut of α, L(α) = {q ∈ Q : q ≤ α}, forms a r.e. set. Equivalently, a real α is left-r.e. if it is the limit of a converging recursive increasing sequence. If we can also compute the radius of convergence effectively, then α is recursive. Left-r.e. reals are the mea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017